27 research outputs found
On the Impact of Geometry on Ad Hoc Communication in Wireless Networks
In this work we address the question how important is the knowledge of
geometric location and network density to the efficiency of (distributed)
wireless communication in ad hoc networks. We study fundamental communication
task of broadcast and develop well-scalable, randomized algorithms that do not
rely on GPS information, and which efficiency formulas do not depend on how
dense the geometric network is. We consider two settings: with and without
spontaneous wake-up of nodes. In the former setting, in which all nodes start
the protocol at the same time, our algorithm accomplishes broadcast in rounds under the SINR model, with high probability (whp), where
is the diameter of the communication graph and is the number of
stations. In the latter setting, in which only the source node containing the
original message is active in the beginning, we develop a slightly slower
algorithm working in rounds whp. Both algorithms are based on a
novel distributed coloring method, which is of independent interest and
potential applicability to other communication tasks under the SINR wireless
model
Deterministic Symmetry Breaking in Ring Networks
We study a distributed coordination mechanism for uniform agents located on a
circle. The agents perform their actions in synchronised rounds. At the
beginning of each round an agent chooses the direction of its movement from
clockwise, anticlockwise, or idle, and moves at unit speed during this round.
Agents are not allowed to overpass, i.e., when an agent collides with another
it instantly starts moving with the same speed in the opposite direction
(without exchanging any information with the other agent). However, at the end
of each round each agent has access to limited information regarding its
trajectory of movement during this round.
We assume that mobile agents are initially located on a circle unit
circumference at arbitrary but distinct positions unknown to other agents. The
agents are equipped with unique identifiers from a fixed range. The {\em
location discovery} task to be performed by each agent is to determine the
initial position of every other agent.
Our main result states that, if the only available information about movement
in a round is limited to %information about distance between the initial and
the final position, then there is a superlinear lower bound on time needed to
solve the location discovery problem. Interestingly, this result corresponds to
a combinatorial symmetry breaking problem, which might be of independent
interest. If, on the other hand, an agent has access to the distance to its
first collision with another agent in a round, we design an asymptotically
efficient and close to optimal solution for the location discovery problem.Comment: Conference version accepted to ICDCS 201
Local Queuing Under Contention
We study stability of local packet scheduling policies in a distributed system of n nodes. The local policies at nodes may only access their local queues, and have no other feedback from the underlying distributed system. The packets arrive at queues according to arrival patterns controlled by an adversary restricted only by injection rate rho and burstiness b. In this work, we assume that the underlying distributed system is a shared channel, in which in order to get rid of a packet from the queue, a node needs to schedule it for transmission on the channel and no other packet is scheduled for transmission at the same time. We show that there is a local adaptive scheduling policy with relatively small memory, which is universally stable on a shared channel, that is, it has bounded queues for any rho= 0. On the other hand, without memory the maximal stable injection rate is O(1/log n). We show a local memoryless (non-adaptive) scheduling policy based on novel idea of ultra strong selectors which is stable for slightly smaller injection c/log^2 n, for some constant c>0